A Polynomial Kernel for Proper Interval Vertex Deletion
نویسندگان
چکیده
It is known that the problem of deleting at most k vertices to obtain a proper interval graph (Proper Interval Vertex Deletion) is fixed parameter tractable. However, whether the problem admits a polynomial kernel or not was open. Here, we answers this question in affirmative by obtaining a polynomial kernel for Proper Interval Vertex Deletion. This resolves an open question of van Bevern, Komusiewicz, Moser, and Niedermeier.
منابع مشابه
Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis
In the Proper Interval Vertex Deletion problem (PIVD), we are given a graph G and an integer parameter k > 0, and the question is whether there are at most k vertices in G whose removal results in a proper interval graph. It is known that the PIVD problem is fixedparameter tractable and admits a polynomial but “unreasonably” large kernel of O(k53) vertices. A natural question is whether the pro...
متن کاملPolynomial Kernels for Proper Interval Completion and Related Problems
Given a graph G = (V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V ×V ) \E such that the graph H = (V,E ∪F ) is a proper interval graph. The Proper Interval Completion problem finds applications in molecular biology and genomic research [16, 24]. First announced by Kaplan, Tarjan and Shamir in FOCS ’94, this proble...
متن کاملParameterized Complexity of Vertex Deletion into Perfect Graph Classes
Vertex deletion problems are at the heart of parameterized complexity. For a graph class F , the F-Deletion problem takes as input a graph G and an integer k. The question is whether it is possible to delete at most k vertices from G such that the resulting graph belongs to F . Whether Perfect Deletion is fixed-parameter tractable, and whether Chordal Deletion admits a polynomial kernel, when p...
متن کاملA polynomial kernel for Block Graph Vertex Deletion
In the Block Graph Deletion problem, we are given a graph G on n vertices and a positive integer k, and the objective is to check whether it is possible to delete at most k vertices from G to make it a block graph, i.e., a graph in which each block is a clique. In this paper, we obtain a kernel with Opkq vertices for the Block Graph Deletion problem. This is a first step to investigate polynomi...
متن کاملUnit Interval Vertex Deletion: Fewer Vertices are Relevant
The unit interval vertex deletion problem asks for a set of at most k vertices whose deletion from an n-vertex graph makes it a unit interval graph. We develop an O(k4)-vertex kernel for the problem, significantly improving the O(k53)-vertex kernel of Fomin, Saurabh, and Villanger [ESA’12; SIAM J. Discrete Math 27(2013)]. We introduce a novel way of organizing cliques of a unit interval graph. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012